Explicit Constructions and Bounds for Batch Codes with Restricted Size of Reconstruction Sets
نویسندگان
چکیده
Abstract. Linear batch codes and codes for private information retrieval (PIR) with a query size t and a restricted size r of the reconstruction sets are studied. New bounds on the parameters of such codes are derived for small values of t or r by providing corresponding constructions. By building on the ideas of Cadambe and Mazumdar, a new bound in a recursive form is derived for batch codes and PIR codes.
منابع مشابه
Covering and radius-covering arrays: Constructions and classification
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering arrays (equivalently, surjective codes with a radius) has been determined precisely only in special cases. In this paper, explicit constructions for numerous best known covering arrays (upper bounds) are found by a combination of combinatorial and computational methods. For radius-covering arrays,...
متن کاملConstructions and Properties of k out of n Visual Secret Sharing Schemes
The idea of visual k out of n secret sharing schemes was introduced in [?]. Explicit constructions for k = 2 and k = n can be found there. For general k out of n schemes bounds have been described. Here, two general k out of n constructions are presented. Their parameters are related to those of maximum size arcs or MDS codes. Further, results on the structure of k out of n schemes, such as bou...
متن کاملPD-sets for Z4-linear codes: Hadamard and Kerdock codes
Permutation decoding is a technique that strongly depends on the existence of a special subset, called PD-set, of the permutation automorphism group of a code. In this paper, a general criterion to obtain s-PD-sets of size s + 1, which enable correction up to s errors, for Z4-linear codes is provided. Furthermore, some explicit constructions of s-PD-sets of size s+1 for important families of (n...
متن کاملExplicit Deterministic Constructions for Membership in the Bitprobe Model
We look at time-space tradeoos for the static membership problem in the bit-probe model. The problem is to represent a set of size up to n from a universe of size m using a small number of bits so that given an element of the universe, its membership in the set can be determined with as few bit probes to the representation as possible. We show several deterministic upper bounds for the case whe...
متن کاملOptimal Fractional Repetition Codes
Fractional repetition (FR) codes is a family of codes for distributed storage systems that allow for uncoded repair having the minimum repair bandwidth. However, in contrast to minimum bandwidth regenerating codes, where a random set of certain size of available nodes is used for a node repair, the repairs with FR codes are table based. In this work we consider bounds on the fractional repetiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1701.07579 شماره
صفحات -
تاریخ انتشار 2017